Predicate Encryption for Multi-dimensional Range Queries from Lattices
نویسندگان
چکیده
We construct a lattice-based predicate encryption scheme for multi-dimensional range and multidimensional subset queries. Our scheme is selectively secure and weakly attribute-hiding, and its security is based on the standard learning with errors (LWE) assumption. Multi-dimensional range and subset queries capture many interesting applications pertaining to searching on encrypted data. To the best of our knowledge, these are the first lattice-based predicate encryption schemes for functionalities beyond IBE and inner product.
منابع مشابه
Evaluating Predicates over Encrypted Data
Predicate encryption is a new encryption paradigm where the secret key owner can perform fine-grained access control over the encrypted data. In particular, the secret key owner can generate a capability corresponding to a query predicate (e.g., whether an encrypted email contains the keyword MEDICAL), and the capability allows one to evaluate the outcome of this predicate on the encrypted data...
متن کاملTree-Based Multi-dimensional Range Search on Encrypted Data with Enhanced Privacy
With searchable encryption, a data user is able to perform meaningful search on encrypted data stored in the public cloud without revealing data privacy. Besides handling simple queries (e.g., keyword queries), complex search functions, such as multi-dimensional (conjunctive) range queries, have also been studied in several approaches to support the search of multi-dimensional data. However, cu...
متن کاملRevocable Predicate Encryption from Lattices
Predicate encryption, formalized by Katz, Sahai, and Waters (EUROCRYPT 2008), is an attractive branch of public-key encryption, which provides fine-grained and role-based access to encrypted data. As for many multi-user cryptosystems, an efficient revocation mechanism is necessary and imperative in the context of predicate encryption, in order to address scenarios when users misbehave or their ...
متن کاملSESOS: A Verifiable Searchable Outsourcing Scheme for Ordered Structured Data in Cloud Computing
While cloud computing is growing at a remarkable speed, privacy issues are far from being solved. One way to diminish privacy concerns is to store data on the cloud in encrypted form. However, encryption often hinders useful computation cloud services. A theoretical approach is to employ the so-called fully homomorphic encryption, yet the overhead is so high that it is not considered a viable s...
متن کاملA Unified Framework for Secure Search Over Encrypted Cloud Data
This paper presents a unified framework that supports different types of privacy-preserving search queries over encrypted cloud data. In the framework, users can perform any of the multi-keyword search, range search and k-nearest neighbor search operations in a privacypreserving manner. All three types of queries are transformed into predicate-based search leveraging bucketization, locality sen...
متن کامل